Iterative reweighted least squares interference alignment approach for multicell MIMO networks
نویسندگان
چکیده
منابع مشابه
Iterative Reweighted Least Squares ∗
Describes a powerful optimization algorithm which iteratively solves a weighted least squares approximation problem in order to solve an L_p approximation problem. 1 Approximation Methods of approximating one function by another or of approximating measured data by the output of a mathematical or computer model are extraordinarily useful and ubiquitous. In this note, we present a very powerful ...
متن کاملAdaptive iterative reweighted least squares design of Lp FIR filters
This paper presents an efficient adaptive algorithm for designing FIR digital filters that are efficient according to an Lp error criteria. The algorithm is an extension of Burrus’ iterative reweighted least-squares (IRLS) method for approximating Lp filters. Such algorithm will converge for most significant cases in a few iterations. In some cases however, the transition bandwidth is such that...
متن کاملIterative reweighted least-squares design of FIR filters
ABSTRACT This paper presents an efficient adaptive algorithm for designing FIR digital filters that are efficient according to an error criteria. The algorithm is an extension of Burrus’ iterative reweighted least-squares (IRLS) method for approximating filters. Such algorithm will converge for most significant cases in a few iterations. In some cases however, the transition bandwidth is such t...
متن کاملHandover Sequences for Interference-Aware Transmission in Multicell MIMO Networks
Providing cell-specific reference signals is a basic requirement for advanced transmission techniques reducing the inter-cell interference in the mobile radio network. In this paper, we introduce so-called handover sequences. They consist of a comb cyclically shifted in the frequency domain to identify the cells. Orthogonal sequences in time domain are used to identify the antennas within a cel...
متن کاملImproved Iteratively Reweighted Least Squares for Unconstrained
In this paper, we first study q minimization and its associated iterative reweighted algorithm for recovering sparse vectors. Unlike most existing work, we focus on unconstrained q minimization, for which we show a few advantages on noisy measurements and/or approximately sparse vectors. Inspired by the results in [Daubechies et al., Comm. Pure Appl. Math., 63 (2010), pp. 1–38] for constrained ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Communications Express
سال: 2015
ISSN: 2187-0136
DOI: 10.1587/comex.4.1